On random shifted standard Young tableaux and 132-avoiding sorting networks
نویسندگان
چکیده
منابع مشابه
Diagonal Vectors of Shifted Young Tableaux
X iv :0 80 3. 22 53 v2 [ m at h. C O ] 4 F eb 2 00 9 DIAGONAL VECTORS OF SHIFTED YOUNG TABLEAUX DORIAN CROITORU Abstra t. We study ve tors formed by entries on the diagonal of standard Young tableaux of shifted shapes. Su h ve tors are in bije tion with integer latti e points of ertain integral polytopes, whi h are Minkowski sums of simpli es. We also des ribe verti es of these polytopes, and o...
متن کاملRandom Young Tableaux
We derive new combinatorial identities which may be viewed as multivariate analogs of summation formulas for hypergeometric series. As in the previous paper Re], we start with probability distributions on the space of the innnite Young tableaux. Then we calculate the probability that the entry of a random tableau at a given box equals n = 1; 2; : : :. Summing these probabilities over n and equa...
متن کاملHopf Structures on Standard Young Tableaux
We review the Poirier-Reutenauer Hopf structure on Standard Young Tableaux and show that it is a distinguished member of a family of Hopf structures. The family in question is related to deformed parastatistics. In this paper K is a field of characteristic zero and all vector spaces are over K. A K[S]-module is a collection of K[Sr]-modules of the symmetric groups Sr. A H(q)-module is a collect...
متن کاملOn Descents in Standard Young Tableaux
In this paper, explicit formulae for the expectation and the variance of descent functions on random standard Young tableaux are presented. Using these, it is shown that the normalized variance, V/E2, is bounded if and only if a certain inequality relating tableau shape to the descent function holds.
متن کاملBijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted
Bijective proofs of the hook formulas for the number of ordinary standard Young tableaux and for the number of shifted standard Young tableaux are given. They are formulated in a uniform manner, and in fact prove q-analogues of the ordinary and shifted hook formulas. The proofs proceed by combining the ordinary, respectively shifted, Hillman–Grassl algorithm and Stanley's (P, ω)-partition theor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic Combinatorics
سال: 2020
ISSN: 2589-5486
DOI: 10.5802/alco.133